On the Frobenius Number of a Modular Diophantine Inequality
نویسنده
چکیده
We present an algorithm for computing the greatest integer that is not a solution of the modular Diophantine inequality ax mod b 6 x, with complexity similar to the complexity of the Euclid algorithm for computing the greatest common divisor of two integers.
منابع مشابه
Symmetric Modular Diophantine Inequalities
In this paper we study and characterize those Diophantine inequalities axmod b ≤ x whose set of solutions is a symmetric numerical semigroup. Given two integers a and b with b = 0 we write a mod b to denote the remainder of the division of a by b. Following the notation used in [8], a modular Diophantine inequality is an expression of the form ax mod b ≤ x. The set S(a, b) of integer solutions ...
متن کاملProportionally Modular Diophantine Inequalities and Full Semigroups
A proportionally modular numerical semigroup is the set of nonnegative integer solutions to a Diophantine inequality of the type axmod b ≤ cx . We give a new presentation for these semigroups and we relate them with a type of affine full semigroups. Next, we describe explicitly the minimal generating system for the affine full semigroups we are considering. As a consequence, we obtain generatin...
متن کاملSome functional inequalities in variable exponent spaces with a more generalization of uniform continuity condition
Some functional inequalities in variable exponent Lebesgue spaces are presented. The bi-weighted modular inequality with variable exponent $p(.)$ for the Hardy operator restricted to non- increasing function which is$$int_0^infty (frac{1}{x}int_0^x f(t)dt)^{p(x)}v(x)dxleqCint_0^infty f(x)^{p(x)}u(x)dx,$$ is studied. We show that the exponent $p(.)$ for which these modular ine...
متن کاملA geometric approach to the diophantine Frobenius problem
It turns out that all instances of the diophantine Frobenius problem for three coprime ai have a common geometric structure which is independent of arithmetic coincidences among the ai. By exploiting this structure we easily obtain Johnson’s formula for the largest non-representable z, as well as a formula for the number of such z. A procedure is described which computes these quantities in O(l...
متن کاملOn the Diophantine Equation x^6+ky^3=z^6+kw^3
Given the positive integers m,n, solving the well known symmetric Diophantine equation xm+kyn=zm+kwn, where k is a rational number, is a challenge. By computer calculations, we show that for all integers k from 1 to 500, the Diophantine equation x6+ky3=z6+kw3 has infinitely many nontrivial (y≠w) rational solutions. Clearly, the same result holds for positive integers k whose cube-free part is n...
متن کامل